Optimal Mechanism Design without Money

نویسندگان

  • Alex Gershkov
  • Benny Moldovanu
  • Xianwen Shi
چکیده

We consider the standard mechanism design environment with linear utility but without monetary transfers. We establish an equivalence between deterministic, dominant strategy incentive compatible mechanisms and generalized median voter schemes, and we use this equivalence to characterize the constrained-efficient optimal mechanism for an utilitarian planner. ∗Gershkov: Department of Economics, Hebrew University of Jerusalem, Israel and School of Economics, University of Surrey, UK, [email protected]; Moldovanu: Department of Economics, University of Bonn, Germany, [email protected]; Shi: Department of Economics, University of Toronto, Canada, [email protected].

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Continuity in Mechanism Design without Transfers

We adopt a mechanism design approach to model communication between a principal and a privately informed agent in the context where monetary incentives are not available. We provide a simple condition on the distribution of the agent’s type which ensures that the optimal mechanism is continuous. With strict log-concavity of the distribution, there exists a unique optimal mechanism that is chara...

متن کامل

Optimal Mechansim Design and Money Burning

Mechanism design is now a standard tool in computer science for aligning the incentives of self-interested agents with the objectives of a system designer. There is, however, a fundamental disconnect between the traditional application domains of mechanism design (such as auctions) and those arising in computer science (such as networks): while monetary transfers (i.e., payments) are essential ...

متن کامل

Optimal allocation design without transfers PRELIMINARY DRAFT

This paper studies the allocation of goods to agents without monetary transfers and incomplete information. Agents’ have private, multi-dimensional utilities over goods, drawn from commonly known priors, possibly asymmetric across agents’ types. Both cardinal and ordinal mechanisms are studied. For tractability, a large market approximation is considered with a continuum of agents for each type...

متن کامل

A Survey on Approximation Mechanism Design without Money for Facility Games

In a facility game one or more facilities are placed in a metric space to serve a set of selfish agents whose addresses are their private information. In a classical facility game, each agent wants to be as close to a facility as possible, and the cost of an agent can be defined as the distance between her location and the closest facility. In an obnoxious facility game, each agent wants to be ...

متن کامل

Mechanism Design for the Online Allocation of Items without Monetary Payments

We consider online mechanism design without money, where agents are allowed to trade items with other agents, in an attempt to improve their own allocation. In an off-line context, this problem is known as the House Allocation Problem (HAP). We extend HAP to an online problem and call it the Online House Allocation Problem (OHAP). In OHAP, agents can choose when to arrive and depart over time a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013